COMPARATIVE ANALYSIS OF QUANTUM KEY DISTRIBUTION SYSTEMS

Comparative Analysis of Quantum Key Distribution Protocols with Two, Three and Four-state Systems

Cryptographic protocols can be classified by the type of security against eavesdropping which they provide. There exist mathematically secure schemes whose security relies on mathematical proofs or conjectures about the complexity of deciphering the message without possessing the correct key. The majority of current secure public Internet connections rely on such schemes. Alternatively, a crypt...

Finite-key analysis for practical implementations of quantum key distribution

The lists of bits processed in quantum key distribution are necessarily of finite length. The need for finite-key unconditional security bounds was recognized long ago, but the theoretical tools have become available only very recently. We provide finite-key unconditional security bounds for two practical implementations of the Bennett–Brassard 1984 coding: prepareand-measure implementations wi...

Finite-key analysis for measurement-device-independent quantum key distribution.

Quantum key distribution promises unconditionally secure communications. However, as practical devices tend to deviate from their specifications, the security of some practical systems is no longer valid. In particular, an adversary can exploit imperfect detectors to learn a large part of the secret key, even though the security proof claims otherwise. Recently, a practical approach--measuremen...

Quantum Key Distribution

Quantum Authenticated Key Distribution

Quantum key distribution algorithms use a quantum communication channel with quantum information and a classical communication channel for binary information. The classical channel, in all algorithms to date, was required to be authenticated. Moreover, Lomonaco [8] claimed that authentication is not possible using only quantum means. This paper reverses this claim. We design an algorithm for qu...